منابع مشابه
An Approximate, Multivariable Version of Specht’s Theorem
In this paper we provide generalizations of Specht’s Theorem which states that two n× n matrices A and B are unitarily equivalent if and only if all traces of words in two non-commuting variables applied to the pairs (A, A∗) and (B, B∗) coincide. First, we obtain conditions which allow us to extend this to simultaneous similarity or unitary equivalence of families of operators, and secondly, we...
متن کاملThe approximate tubular neighborhood theorem
Skeleta and other pure subsets of manifold stratified spaces are shown to have neighborhoods which are teardrops of stratified approximate fibrations (under dimension and compactness assumptions). In general, the stratified approximate fibrations cannot be replaced by bundles, and the teardrops cannot be replaced by mapping cylinder neighborhoods. Thus, this is the best possible topological tub...
متن کاملAn Improved Error Bound Theorem for Approximate Markov Chain s
Recently an error bound theorem was reported to conclude analytic error bounds for approximate Markov chains. The theorem required a uniform bound for marginal expectations of the approximate model. This note will relax this bound to steady state rather than marginal expectations as of practical interest: (i) to simplify verification and/or (ii) to obtain a more accurate error bound. An ALOHA-t...
متن کاملAn Approximate Folk Theorem with Imperfect Private Information
We give a partial folk theorem for approximate equilibria of a class of discounted repeated games where each player receives a private signal of the play of his opponents . Our condition is that the game be "informationally connected," meaning that each player i has a deviation that can be statistically detected by player j regardless of the action of any third player k. Under the same conditio...
متن کاملAn Approximate Restatement of the Four-Color Theorem
The celebrated Four-Color Theorem was first conjectured in the 1850’s. Since then there had been many partial results. More than a century later, it was first proved by Appel and Haken [1] and then subsequently improved by Robertson et al. [8]. These proofs make extensive use of computer for various computations involved. In mathematical community, there continues to be an interest for a proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2017
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-017-9368-6